A decomposition approach for commodity pickup and delivery with time-windows under uncertainty

We consider a special class of large-scale, network-based, resource allocation problems under uncertainty, namely that of multi-commodity flows with time-windows under uncertainty. In this class, we focus on problems involving commodity pickup and delivery with time windows. Our work examines methods of proactive planning, that is, robust plan generation to protect against future uncertainty. By a priori modeling uncertainties in data corresponding to service times, resource availability, supplies and demands, we generate solutions that are more robust operationally, that is, more likely to be executed or easier to repair when disrupted. We propose a novel modeling and solution framework involving a decomposition scheme that separates problems into a routing master problem and scheduling sub-problems; and iterates to find the optimal solution. Uncertainty is captured in part by the master problem and in part by the scheduling subproblem. We present proof-of-concept for our approach using real data involving routing and scheduling for a large shipment carrier’s ground network, and demonstrate the improved robustness of solutions from our approach. Lavanya Marla iLab, Heinz College, Carnegie Mellon University Pittsburgh, PA. E-mail: [email protected] Cynthia Barnhart Department of Civil and Environmental Engineering, Massachusetts Institute of Technology Cambridge, MA. E-mail: [email protected] Varun Biyani Heinz College, Carnegie Mellon University Pittsburgh, PA. E-mail: [email protected]